Complexity of packing common bases in matroids
نویسندگان
چکیده
منابع مشابه
On Disjoint Common Bases in Two Matroids
We prove two results on packing common bases of two matroids. First, we show that the computational problem of common base packing reduces to the special case where one of the matroids is a partition matroid. Second, we give a counterexample to a conjecture of Chow, which proposed a sufficient condition for the existence of a common base packing. Chow’s conjecture is a generalization of Rota’s ...
متن کاملOn packing spanning trees in graphs and bases in matroids
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We provide structural descriptions of such graphs and matroids. In the case of graphs, our results are relevant for certain communication protocols.
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملPacking circuits in matroids
The purpose of this paper is to characterize all matroids M that satisfy the following minimax relation: For any nonnegative integral weight function w defined on E(M), Maximum {k : M has k circuits (repetition allowed) such that each element e of M is used at most 2w(e) times by these circuits} = Minimum {x∈X w(x) : X is a collection of elements (repetition allowed) of M such that every circui...
متن کاملBases in Infinite Matroids
We consider bases in matroids of infinite rank, and prove: (a) the existence of a perfect matching in the 'transition graph' of any two bases. This is an extension of the existence of a non-zero generalized diagonal in the transition matrix between bases in finite dimensional linear spaces, and settles a conjecture of the second author [8]. (b) A Cantor-Bernstein theorem for matroids. (c) The e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2020
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-020-01497-y